package com.shuzijun.leetcode.editor.cn;
public class ReverseString{
    public static void main(String[] args) {
         
         Solution solution = new ReverseString().new Solution();
        
        
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public void reverseString(char[] s) {
        int n = s.length;
        int i = 0;
        int j = n-1;
        while (i <= j){
            char tmp = s[i];
            s[i] = s[j];
            s[j] = tmp;
            i++;
            j--;
        }
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}